// C# recursive program to solve  
// tower of hanoi puzzle 
using System; 
  
class geek 
{ 
  
    // C# recursive function to solve  
    // tower of hanoi puzzle 
    static void towerOfHanoi(int n, char from_rod,  
                             char to_rod, char aux_rod) 
    { 
        if (n == 1) 
        { 
            Console.WriteLine("Move disk 1 from rod " + from_rod  
                                           + " to rod " + to_rod); 
            return; 
        } 
        towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 
        Console.WriteLine("Move disk " + n + " from rod " 
                          + from_rod + " to rod " + to_rod); 
        towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 
    } 
      
    // Driver method 
    public static void Main() 
    { 
        // Number of disks 
        int n = 4;  
          
        // A, B and C are names of rods 
        towerOfHanoi(n, 'A', 'C', 'B');  
    } 
} 
